Storage device group split technique for extent pool with hybrid capacity storage devices system and method

ABSTRACT

A method, computer program product, and computer system for initializing, on a computing device, an N*N Weighted Neighborhood Matrix according to an existing Mapped RAID layout. N disks in an original disk partner group (DPG) may be partitioned into a target DPG, where N is a number of disks in an extent pool, wherein the N disks have at least two different capacities. The target DPG may be marked for at least a portion of the N disks. The target DPG may be marked for E RAID extents, where E is a number of RAID extents in the original DPG. At least a portion of disk extents for the E RAID extents in the original DPG may be moved to the target DPG.

BACKGROUND

Generally, with the increasing amounts of information being stored, it may be beneficial to efficiently store and manage that information. While there may be numerous techniques for storing and managing information, each technique may have tradeoffs between reliability and efficiency.

BRIEF SUMMARY OF DISCLOSURE

In one example implementation, a method, performed by one or more computing devices, may include but is not limited to initializing, on a computing device, an N*N Weighted Neighborhood Matrix according to an existing Mapped RAID layout. N disks in an original disk partner group (DPG) may be partitioned into a target DPG, where N is a number of disks in an extent pool, wherein the N disks have at least two different capacities. The target DPG may be marked for at least a portion of the N disks. The target DPG may be marked for E RAID extents, where E is a number of RAID extents in the original DPG. At least a portion of disk extents for the E RAID extents in the original DPG may be moved to the target DPG.

One or more of the following example features may be included. Moving at least the portion of disk extents for the E RAID extents in the original DPG to the target DPG may include selecting a target RAID extent, for each of at least the portion of disk extents, which may result in a balance of free disk extent counts in the original DPG and the target DPG Moving at least the portion of disk extents for the E RAID extents in the original DPG to the target DPG may include virtually removing from the original DPG any disk extents for the E RAID extents belonging to the target DPG The N*N Weighted Neighborhood Matrix may be updated based upon, at least in part, the virtual removal. A new disk extent may be located in the target DPG for each disk extent virtually removed. Locating the new disk extent in the target DPG for each disk extent virtually removed may include locating a valid and optimal disk extent in the target DPG that may result in a lowest variance of sub-matrix values for the target DPG The new disk extent may be allocated in the target DPG for each disk extent virtually removed.

In another example implementation, a computing system may include one or more processors and one or more memories configured to perform operations that may include but are not limited to initializing an N*N Weighted Neighborhood Matrix according to an existing Mapped RAID layout. N disks in an original disk partner group (DPG) may be partitioned into a target DPG, where N is a number of disks in an extent pool, wherein the N disks have at least two different capacities. The target DPG may be marked for at least a portion of the N disks. The target DPG may be marked for E RAID extents, where E is a number of RAID extents in the original DPG. At least a portion of disk extents for the E RAID extents in the original DPG may be moved to the target DPG.

One or more of the following example features may be included. Moving at least the portion of disk extents for the E RAID extents in the original DPG to the target DPG may include selecting a target RAID extent, for each of at least the portion of disk extents, which may result in a balance of free disk extent counts in the original DPG and the target DPG Moving at least the portion of disk extents for the E RAID extents in the original DPG to the target DPG may include virtually removing from the original DPG any disk extents for the E RAID extents belonging to the target DPG The N*N Weighted Neighborhood Matrix may be updated based upon, at least in part, the virtual removal. A new disk extent may be located in the target DPG for each disk extent virtually removed. Locating the new disk extent in the target DPG for each disk extent virtually removed may include locating a valid and optimal disk extent in the target DPG that may result in a lowest variance of sub-matrix values for the target DPG The new disk extent may be allocated in the target DPG for each disk extent virtually removed.

In another example implementation, a computer program product may reside on a computer readable storage medium having a plurality of instructions stored thereon which, when executed across one or more processors, may cause at least a portion of the one or more processors to perform operations that may include but are not limited to initializing an N*N Weighted Neighborhood Matrix according to an existing Mapped RAID layout. N disks in an original disk partner group (DPG) may be partitioned into a target DPG, where N is a number of disks in an extent pool, wherein the N disks have at least two different capacities. The target DPG may be marked for at least a portion of the N disks. The target DPG may be marked for E RAID extents, where E is a number of RAID extents in the original DPG. At least a portion of disk extents for the E RAID extents in the original DPG may be moved to the target DPG.

One or more of the following example features may be included. Moving at least the portion of disk extents for the E RAID extents in the original DPG to the target DPG may include selecting a target RAID extent, for each of at least the portion of disk extents, which may result in a balance of free disk extent counts in the original DPG and the target DPG Moving at least the portion of disk extents for the E RAID extents in the original DPG to the target DPG may include virtually removing from the original DPG any disk extents for the E RAID extents belonging to the target DPG The N*N Weighted Neighborhood Matrix may be updated based upon, at least in part, the virtual removal. A new disk extent may be located in the target DPG for each disk extent virtually removed. Locating the new disk extent in the target DPG for each disk extent virtually removed may include locating a valid and optimal disk extent in the target DPG that may result in a lowest variance of sub-matrix values for the target DPG The new disk extent may be allocated in the target DPG for each disk extent virtually removed.

The details of one or more example implementations are set forth in the accompanying drawings and the description below. Other possible example features and/or possible example advantages will become apparent from the description, the drawings, and the claims. Some implementations may not have those possible example features and/or possible example advantages, and such possible example features and/or possible example advantages may not necessarily be required of some implementations.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is an example diagrammatic view of a split process coupled to an example distributed computing network according to one or more example implementations of the disclosure;

FIG. 2 is an example diagrammatic view of a computer of FIG. 1 according to one or more example implementations of the disclosure;

FIG. 3 is an example diagrammatic view of a storage target of FIG. 1 according to one or more example implementations of the disclosure;

FIG. 4 is an example diagrammatic view of a RAID layout of FIG. 1 according to one or more example implementations of the disclosure;

FIG. 5 is an example diagrammatic view of a Mapped RAID extent layout of FIG. 1 according to one or more example implementations of the disclosure;

FIG. 6 is an example diagrammatic view of a disk relationship layout of FIG. 1 according to one or more example implementations of the disclosure;

FIG. 7 is an example diagrammatic view of matrices according to one or more example implementations of the disclosure;

FIG. 8 is an example flowchart of a split process according to one or more example implementations of the disclosure;

FIG. 9 is an example diagrammatic view of a disk splitting layout of a DPG according to one or more example implementations of the disclosure;

FIG. 10 is an example diagrammatic view of a small pool configuration split according to one or more example implementations of the disclosure; and

FIG. 11 is an example diagrammatic view of a large pool configuration split according to one or more example implementations of the disclosure.

Like reference symbols in the various drawings indicate like elements.

DETAILED DESCRIPTION

System Overview:

In some implementations, the present disclosure may be embodied as a method, system, or computer program product. Accordingly, in some implementations, the present disclosure may take the form of an entirely hardware implementation, an entirely software implementation (including firmware, resident software, micro-code, etc.) or an implementation combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, in some implementations, the present disclosure may take the form of a computer program product on a computer-usable storage medium having computer-usable program code embodied in the medium.

In some implementations, any suitable computer usable or computer readable medium (or media) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. The computer-usable, or computer-readable, storage medium (including a storage device associated with a computing device or client electronic device) may be, for example, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer-readable medium may include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a digital versatile disk (DVD), a static random access memory (SRAM), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, a media such as those supporting the internet or an intranet, or a magnetic storage device. Note that the computer-usable or computer-readable medium could even be a suitable medium upon which the program is stored, scanned, compiled, interpreted, or otherwise processed in a suitable manner, if necessary, and then stored in a computer memory. In the context of the present disclosure, a computer-usable or computer-readable, storage medium may be any tangible medium that can contain or store a program for use by or in connection with the instruction execution system, apparatus, or device.

In some implementations, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. In some implementations, such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. In some implementations, the computer readable program code may be transmitted using any appropriate medium, including but not limited to the internet, wireline, optical fiber cable, RF, etc. In some implementations, a computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.

In some implementations, computer program code for carrying out operations of the present disclosure may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Java®, Smalltalk, C++ or the like. Java® and all Java-based trademarks and logos are trademarks or registered trademarks of Oracle and/or its affiliates. However, the computer program code for carrying out operations of the present disclosure may also be written in conventional procedural programming languages, such as the “C” programming language, PASCAL, or similar programming languages, as well as in scripting languages such as Javascript, PERL, or Python. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the internet using an Internet Service Provider). In some implementations, electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGAs) or other hardware accelerators, micro-controller units (MCUs), or programmable logic arrays (PLAs) may execute the computer readable program instructions/code by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present disclosure.

In some implementations, the flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of apparatus (systems), methods and computer program products according to various implementations of the present disclosure. Each block in the flowchart and/or block diagrams, and combinations of blocks in the flowchart and/or block diagrams, may represent a module, segment, or portion of code, which comprises one or more executable computer program instructions for implementing the specified logical function(s)/act(s). These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the computer program instructions, which may execute via the processor of the computer or other programmable data processing apparatus, create the ability to implement one or more of the functions/acts specified in the flowchart and/or block diagram block or blocks or combinations thereof. It should be noted that, in some implementations, the functions noted in the block(s) may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved.

In some implementations, these computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function/act specified in the flowchart and/or block diagram block or blocks or combinations thereof.

In some implementations, the computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed (not necessarily in a particular order) on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions/acts (not necessarily in a particular order) specified in the flowchart and/or block diagram block or blocks or combinations thereof.

Referring now to the example implementation of FIG. 1, there is shown split process 10 that may reside on and may be executed by a computer (e.g., computer 12), which may be connected to a network (e.g., network 14) (e.g., the internet or a local area network). Examples of computer 12 (and/or one or more of the client electronic devices noted below) may include, but are not limited to, a storage system (e.g., a Network Attached Storage (NAS) system, a Storage Area Network (SAN)), a personal computer(s), a laptop computer(s), mobile computing device(s), a server computer, a series of server computers, a mainframe computer(s), or a computing cloud(s). As is known in the art, a SAN may include one or more of the client electronic devices, including a RAID device and a NAS system. In some implementations, each of the aforementioned may be generally described as a computing device. In certain implementations, a computing device may be a physical or virtual device. In many implementations, a computing device may be any device capable of performing operations, such as a dedicated processor, a portion of a processor, a virtual processor, a portion of a virtual processor, portion of a virtual device, or a virtual device. In some implementations, a processor may be a physical processor or a virtual processor. In some implementations, a virtual processor may correspond to one or more parts of one or more physical processors. In some implementations, the instructions/logic may be distributed and executed across one or more processors, virtual or physical, to execute the instructions/logic. Computer 12 may execute an operating system, for example, but not limited to, Microsoft® Windows®; Mac® OS X®; Red Hat® Linux®, Windows® Mobile, Chrome OS, Blackberry OS, Fire OS, or a custom operating system. (Microsoft and Windows are registered trademarks of Microsoft Corporation in the United States, other countries or both; Mac and OS X are registered trademarks of Apple Inc. in the United States, other countries or both; Red Hat is a registered trademark of Red Hat Corporation in the United States, other countries or both; and Linux is a registered trademark of Linus Torvalds in the United States, other countries or both).

In some implementations, as will be discussed below in greater detail, a split process, such as split process 10 of FIG. 1, may initialize, on a computing device, an N*N Weighted Neighborhood Matrix according to an existing Mapped RAID layout. N disks in an original disk partner group (DPG) may be partitioned into a target DPG, where N is a number of disks in an extent pool, wherein the N disks have at least two different capacities. The target DPG may be marked for at least a portion of the N disks. The target DPG may be marked for E RAID extents, where E is a number of RAID extents in the original DPG. At least a portion of disk extents for the E RAID extents in the original DPG may be moved to the target DPG.

In some implementations, the instruction sets and subroutines of split process 10, which may be stored on storage device, such as storage device 16, coupled to computer 12, may be executed by one or more processors and one or more memory architectures included within computer 12. In some implementations, storage device 16 may include but is not limited to: a hard disk drive; all forms of flash memory storage devices; a tape drive; an optical drive; a RAID array (or other array); a random access memory (RAM); a read-only memory (ROM); or combination thereof. In some implementations, storage device 16 may be organized as an extent, an extent pool, a RAID extent (e.g., an example 4D+1P R5, where the RAID extent may include, e.g., five storage device extents that may be allocated from, e.g., five different storage devices), a mapped RAID (e.g., a collection of RAID extents), or combination thereof.

In some implementations, network 14 may be connected to one or more secondary networks (e.g., network 18), examples of which may include but are not limited to: a local area network; a wide area network; or an intranet, for example.

In some implementations, computer 12 may include a data store, such as a database (e.g., relational database, object-oriented database, triplestore database, etc.) and may be located within any suitable memory location, such as storage device 16 coupled to computer 12. In some implementations, data, metadata, information, etc. described throughout the present disclosure may be stored in the data store. In some implementations, computer 12 may utilize any known database management system such as, but not limited to, DB2, in order to provide multi-user access to one or more databases, such as the above noted relational database. In some implementations, the data store may also be a custom database, such as, for example, a flat file database or an XML database. In some implementations, any other form(s) of a data storage structure and/or organization may also be used. In some implementations, split process 10 may be a component of the data store, a standalone application that interfaces with the above noted data store and/or an applet/application that is accessed via client applications 22, 24, 26, 28. In some implementations, the above noted data store may be, in whole or in part, distributed in a cloud computing topology. In this way, computer 12 and storage device 16 may refer to multiple devices, which may also be distributed throughout the network. An example cloud computing environment that may be used with the disclosure may include but is not limited to, e.g., Elastic Cloud Storage (ECS™) from Dell EMC™ of Hopkinton, Mass. In some implementations, other cloud computing environments may be used without departing from the scope of the disclosure.

In some implementations, computer 12 may execute a storage management application (e.g., storage management application 21), examples of which may include, but are not limited to, e.g., a storage system application, a cloud computing application, a data synchronization application, a data migration application, a garbage collection application, or other application that allows for the implementation and/or management of data in a clustered (or non-clustered) environment (or the like). In some implementations, split process 10 and/or storage management application 21 may be accessed via one or more of client applications 22, 24, 26, 28. In some implementations, split process 10 may be a standalone application, or may be an applet/application/script/extension that may interact with and/or be executed within storage management application 21, a component of storage management application 21, and/or one or more of client applications 22, 24, 26, 28. In some implementations, storage management application 21 may be a standalone application, or may be an applet/application/script/extension that may interact with and/or be executed within split process 10, a component of split process 10, and/or one or more of client applications 22, 24, 26, 28. In some implementations, one or more of client applications 22, 24, 26, 28 may be a standalone application, or may be an applet/application/script/extension that may interact with and/or be executed within and/or be a component of split process 10 and/or storage management application 21. Examples of client applications 22, 24, 26, 28 may include, but are not limited to, e.g., a storage system application, a cloud computing application, a data synchronization application, a data migration application, a garbage collection application, or other application that allows for the implementation and/or management of data in a clustered (or non-clustered) environment (or the like), a standard and/or mobile web browser, an email application (e.g., an email client application), a textual and/or a graphical user interface, a customized web browser, a plugin, an Application Programming Interface (API), or a custom application. The instruction sets and subroutines of client applications 22, 24, 26, 28, which may be stored on storage devices 30, 32, 34, 36, coupled to client electronic devices 38, 40, 42, 44, may be executed by one or more processors and one or more memory architectures incorporated into client electronic devices 38, 40, 42, 44.

In some implementations, one or more of storage devices 30, 32, 34, 36, may include but are not limited to: hard disk drives; flash drives, tape drives; optical drives; RAID arrays; random access memories (RAM); and read-only memories (ROM). Examples of client electronic devices 38, 40, 42, 44 (and/or computer 12) may include, but are not limited to, a personal computer (e.g., client electronic device 38), a laptop computer (e.g., client electronic device 40), a smart/data-enabled, cellular phone (e.g., client electronic device 42), a notebook computer (e.g., client electronic device 44), a tablet, a server, a television, a smart television, a media (e.g., video, photo, etc.) capturing device, and a dedicated network device. Client electronic devices 38, 40, 42, 44 may each execute an operating system, examples of which may include but are not limited to, Android™, Apple® iOS®, Mac® OS X®; Red Hat® Linux®, Windows® Mobile, Chrome OS, Blackberry OS, Fire OS, or a custom operating system.

In some implementations, one or more of client applications 22, 24, 26, 28 may be configured to effectuate some or all of the functionality of split process 10 (and vice versa). Accordingly, in some implementations, split process 10 may be a purely server-side application, a purely client-side application, or a hybrid server-side/client-side application that is cooperatively executed by one or more of client applications 22, 24, 26, 28 and/or split process 10.

In some implementations, one or more of client applications 22, 24, 26, 28 may be configured to effectuate some or all of the functionality of storage management application 21 (and vice versa). Accordingly, in some implementations, storage management application 21 may be a purely server-side application, a purely client-side application, or a hybrid server-side/client-side application that is cooperatively executed by one or more of client applications 22, 24, 26, 28 and/or storage management application 21. As one or more of client applications 22, 24, 26, 28, split process 10, and storage management application 21, taken singly or in any combination, may effectuate some or all of the same functionality, any description of effectuating such functionality via one or more of client applications 22, 24, 26, 28, split process 10, storage management application 21, or combination thereof, and any described interaction(s) between one or more of client applications 22, 24, 26, 28, split process 10, storage management application 21, or combination thereof to effectuate such functionality, should be taken as an example only and not to limit the scope of the disclosure.

In some implementations, one or more of users 46, 48, 50, 52 may access computer 12 and split process 10 (e.g., using one or more of client electronic devices 38, 40, 42, 44) directly through network 14 or through secondary network 18. Further, computer 12 may be connected to network 14 through secondary network 18, as illustrated with phantom link line 54. Split process 10 may include one or more user interfaces, such as browsers and textual or graphical user interfaces, through which users 46, 48, 50, 52 may access split process 10.

In some implementations, the various client electronic devices may be directly or indirectly coupled to network 14 (or network 18). For example, client electronic device 38 is shown directly coupled to network 14 via a hardwired network connection. Further, client electronic device 44 is shown directly coupled to network 18 via a hardwired network connection. Client electronic device 40 is shown wirelessly coupled to network 14 via wireless communication channel 56 established between client electronic device 40 and wireless access point (i.e., WAP) 58, which is shown directly coupled to network 14. WAP 58 may be, for example, an IEEE 802.11a, 802.11b, 802.11g, 802.11n, 802.11ac, Wi-Fi®, RFID, and/or Bluetooth™ (including Bluetooth™ Low Energy) device that is capable of establishing wireless communication channel 56 between client electronic device 40 and WAP 58. Client electronic device 42 is shown wirelessly coupled to network 14 via wireless communication channel 60 established between client electronic device 42 and cellular network/bridge 62, which is shown by example directly coupled to network 14.

In some implementations, some or all of the IEEE 802.11x specifications may use Ethernet protocol and carrier sense multiple access with collision avoidance (i.e., CSMA/CA) for path sharing. The various 802.11x specifications may use phase-shift keying (i.e., PSK) modulation or complementary code keying (i.e., CCK) modulation, for example. Bluetooth™ (including Bluetooth™ Low Energy) is a telecommunications industry specification that allows, e.g., mobile phones, computers, smart phones, and other electronic devices to be interconnected using a short-range wireless connection. Other forms of interconnection (e.g., Near Field Communication (NFC)) may also be used.

In some implementations, various I/O requests (e.g., I/O request 15) may be sent from, e.g., client applications 22, 24, 26, 28 to, e.g., computer 12. Examples of I/O request 15 may include but are not limited to, data write requests (e.g., a request that content be written to computer 12) and data read requests (e.g., a request that content be read from computer 12).

Data Storage System:

Referring also to the example implementation of FIGS. 2-3 (e.g., where computer 12 may be configured as a data storage system), computer 12 may include storage processor 100 and a plurality of storage targets (e.g., storage targets 102, 104, 106, 108, 110). In some implementations, storage targets 102, 104, 106, 108, 110 may include any of the above-noted storage devices. In some implementations, storage targets 102, 104, 106, 108, 110 may be configured to provide various levels of performance and/or high availability. For example, storage targets 102, 104, 106, 108, 110 may be configured to form a non-fully-duplicative fault-tolerant data storage system (such as a non-fully-duplicative RAID data storage system), examples of which may include but are not limited to: RAID 3 arrays, RAID 4 arrays, RAID 5 arrays, and/or RAID 6 arrays. It will be appreciated that various other types of RAID arrays may be used without departing from the scope of the present disclosure.

While in this particular example, computer 12 is shown to include five storage targets (e.g., storage targets 102, 104, 106, 108, 110), this is for example purposes only and is not intended limit the present disclosure. For instance, the actual number of storage targets may be increased or decreased depending upon, e.g., the level of redundancy/performance/capacity required.

Further, the storage targets (e.g., storage targets 102, 104, 106, 108, 110) included with computer 12 may be configured to form a plurality of discrete storage arrays. For instance, and assuming for example purposes only that computer 12 includes, e.g., ten discrete storage targets, a first five targets (of the ten storage targets) may be configured to form a first RAID array and a second five targets (of the ten storage targets) may be configured to form a second RAID array.

In some implementations, one or more of storage targets 102, 104, 106, 108, 110 may be configured to store coded data (e.g., via storage management application 21), wherein such coded data may allow for the regeneration of data lost/corrupted on one or more of storage targets 102, 104, 106, 108, 110. Examples of such coded data may include but is not limited to parity data and Reed-Solomon data. Such coded data may be distributed across all of storage targets 102, 104, 106, 108, 110 or may be stored within a specific storage target.

Examples of storage targets 102, 104, 106, 108, 110 may include one or more data arrays, wherein a combination of storage targets 102, 104, 106, 108, 110 (and any processing/control systems associated with storage management application 21) may form data array 112.

The manner in which computer 12 is implemented may vary depending upon e.g., the level of redundancy/performance/capacity required. For example, computer 12 may be configured as a SAN (i.e., a Storage Area Network), in which storage processor 100 may be, e.g., a dedicated computing system and each of storage targets 102, 104, 106, 108, 110 may be a RAID device.

In the example where computer 12 is configured as a SAN, the various components of computer 12 (e.g., storage processor 100, and storage targets 102, 104, 106, 108, 110) may be coupled using network infrastructure 114, examples of which may include but are not limited to an Ethernet (e.g., Layer 2 or Layer 3) network, a fiber channel network, an InfiniBand network, or any other circuit switched/packet switched network.

As discussed above, various I/O requests (e.g., I/O request 15) may be generated. For example, these I/O requests may be sent from, e.g., client applications 22, 24, 26, 28 to, e.g., computer 12. Additionally/alternatively (e.g., when storage processor 100 is configured as an application server or otherwise), these I/O requests may be internally generated within storage processor 100 (e.g., via storage management application 21). Examples of I/O request 15 may include but are not limited to data write request 116 (e.g., a request that content 118 be written to computer 12) and data read request 120 (e.g., a request that content 118 be read from computer 12).

In some implementations, during operation of storage processor 100, content 118 to be written to computer 12 may be received and/or processed by storage processor 100 (e.g., via storage management application 21). Additionally/alternatively (e.g., when storage processor 100 is configured as an application server or otherwise), content 118 to be written to computer 12 may be internally generated by storage processor 100 (e.g., via storage management application 21).

As discussed above, the instruction sets and subroutines of storage management application 21, which may be stored on storage device 16 included within computer 12, may be executed by one or more processors and one or more memory architectures included with computer 12. Accordingly, in addition to being executed on storage processor 100, some or all of the instruction sets and subroutines of storage management application 21 (and/or split process 10) may be executed by one or more processors and one or more memory architectures included with data array 112.

In some implementations, storage processor 100 may include front end cache memory system 122. Examples of front end cache memory system 122 may include but are not limited to a volatile, solid-state, cache memory system (e.g., a dynamic RAM cache memory system), a non-volatile, solid-state, cache memory system (e.g., a flash-based, cache memory system), and/or any of the above-noted storage devices.

In some implementations, storage processor 100 may initially store content 118 within front end cache memory system 122. Depending upon the manner in which front end cache memory system 122 is configured, storage processor 100 (e.g., via storage management application 21) may immediately write content 118 to data array 112 (e.g., if front end cache memory system 122 is configured as a write-through cache) or may subsequently write content 118 to data array 112 (e.g., if front end cache memory system 122 is configured as a write-back cache).

In some implementations, one or more of storage targets 102, 104, 106, 108, 110 may include a backend cache memory system. Examples of the backend cache memory system may include but are not limited to a volatile, solid-state, cache memory system (e.g., a dynamic RAM cache memory system), a non-volatile, solid-state, cache memory system (e.g., a flash-based, cache memory system), and/or any of the above-noted storage devices.

Storage Targets:

As discussed above, one or more of storage targets 102, 104, 106, 108, 110 may be a RAID device. For instance, and referring also to FIG. 3, there is shown example target 150, wherein target 150 may be one example implementation of a RAID implementation of, e.g., storage target 102, storage target 104, storage target 106, storage target 108, and/or storage target 110. Examples of storage devices 154, 156, 158, 160, 162 may include one or more electro-mechanical hard disk drives, one or more solid-state/flash devices, and/or any of the above-noted storage devices.

In some implementations, target 150 may include storage processor 152 and a plurality of storage devices (e.g., storage devices 154, 156, 158, 160, 162). Storage devices 154, 156, 158, 160, 162 may be configured to provide various levels of performance and/or high availability (e.g., via storage management application 21). For example, one or more of storage devices 154, 156, 158, 160, 162 (or any of the above-noted storage devices) may be configured as a RAID 0 array, in which data is striped across storage devices. By striping data across a plurality of storage devices, improved performance may be realized. However, RAID 0 arrays may not provide a level of high availability. Accordingly, one or more of storage devices 154, 156, 158, 160, 162 (or any of the above-noted storage devices) may be configured as a RAID 1 array, in which data is mirrored between storage devices. By mirroring data between storage devices, a level of high availability may be achieved as multiple copies of the data may be stored within storage devices 154, 156, 158, 160, 162.

While storage devices 154, 156, 158, 160, 162 are discussed above as being configured in a RAID 0 or RAID 1 array, this is for example purposes only and not intended to limit the present disclosure, as other configurations are possible. For example, storage devices 154, 156, 158, 160, 162 may be configured as a RAID 3, RAID 4, RAID 5 or RAID 6 array.

While in this particular example, target 150 is shown to include five storage devices (e.g., storage devices 154, 156, 158, 160, 162), this is for example purposes only and not intended to limit the present disclosure. For instance, the actual number of storage devices may be increased or decreased depending upon, e.g., the level of redundancy/performance/capacity required.

In some implementations, one or more of storage devices 154, 156, 158, 160, 162 may be configured to store (e.g., via storage management application 21) coded data, wherein such coded data may allow for the regeneration of data lost/corrupted on one or more of storage devices 154, 156, 158, 160, 162. Examples of such coded data may include but are not limited to parity data and Reed-Solomon data. Such coded data may be distributed across all of storage devices 154, 156, 158, 160, 162 or may be stored within a specific storage device.

The manner in which target 150 is implemented may vary depending upon e.g., the level of redundancy/performance/capacity required. For example, target 150 may be a RAID device in which storage processor 152 is a RAID controller card and storage devices 154, 156, 158, 160, 162 are individual “hot-swappable” hard disk drives. Another example of target 150 may be a RAID system, examples of which may include but are not limited to an NAS (i.e., Network Attached Storage) device or a SAN (i.e., Storage Area Network).

In some implementations, storage target 150 may execute all or a portion of storage management application 21. The instruction sets and subroutines of storage management application 21, which may be stored on a storage device (e.g., storage device 164) coupled to storage processor 152, may be executed by one or more processors and one or more memory architectures included with storage processor 152. Storage device 164 may include but is not limited to any of the above-noted storage devices.

As discussed above, computer 12 may be configured as a SAN, wherein storage processor 100 may be a dedicated computing system and each of storage targets 102, 104, 106, 108, 110 may be a RAID device. Accordingly, when storage processor 100 processes data requests 116, 120, storage processor 100 (e.g., via storage management application 21) may provide the appropriate requests/content (e.g., write request 166, content 168 and read request 170) to, e.g., storage target 150 (which is representative of storage targets 102, 104, 106, 108 and/or 110).

In some implementations, during operation of storage processor 152, content 168 to be written to target 150 may be processed by storage processor 152 (e.g., via storage management application 21). Storage processor 152 may include cache memory system 172. Examples of cache memory system 172 may include but are not limited to a volatile, solid-state, cache memory system (e.g., a dynamic RAM cache memory system) and/or a non-volatile, solid-state, cache memory system (e.g., a flash-based, cache memory system). During operation of storage processor 152, content 168 to be written to target 150 may be received by storage processor 152 (e.g., via storage management application 21) and initially stored (e.g., via storage management application 21) within front end cache memory system 172.

Example RAID Group:

As discussed above, and referring at least to the example implementation of FIG. 4, an example 4D+1P RAID 5 layout 400 a that may be managed (e.g., via storage management application 21) is shown. In the example, data may be distributed across the storage devices (e.g., drives) in one of several ways, referred to as RAID levels, depending on the required level of redundancy and performance. As noted above, while one or more of the figures may shows disks as the storage device, it will be appreciated that any of the storage devices discussed throughout may be used.

Shown for example purposes only, RAID 5 may consist of block level striping with distributed parity. Parity information may be distributed among the drives. In the above example, each stripe may consist of five blocks, which may include four data blocks (e.g., D0, D1, D2, D3) and one parity block (e.g., P). Upon failure of a single drive, subsequent reads may be calculated from the distributed parity such that no data is lost. At the same time, a “hot spare” storage device may be selected to replace the dead storage device, and all the data on the failed drive may be rebuilt and written to the new drive. For instance, and referring at least to the example implementation of FIG. 4, an example RAID 5 rebuild 400 b of the example 4D+1P RAID 5 layout of 400 a is shown.

As storage device capacity increases, the rebuild time may also increase. As a result, there may be an increased risk of a double storage device failure, which may lead to data loss. It will be appreciated that the rebuild time may be subject to the write bandwidth of the hot spare storage device, which may become a bottleneck. In some situations, it may be difficult to reduce the rebuild time for RAID. In some implementations, Mapped RAID technology have help resolve this issue.

Example Mapped RAID Group:

In some implementations, and referring at least to the example implementation of FIG. 5, an example Mapped RAID extent layout 500 a managed (e.g., via storage management application 21) is shown (e.g., a 4D+1P RAID 5 over N disks, where N is greater than 5). Generally, Mapped RAID may be created on top of a disk (or other storage device) pool, which may include N disks (or other storage devices). Broadly speaking, each disk may be viewed as a set of continuous, non-overlapping, fixed sized disk extents. In the example of FIG. 5, while creating a RAID extent, 5 disk extents may be selected from 5 different disks. Some disk extents on each disk may be reserved as hot spare disk extents (e.g., instead of reserving the whole disk as a hot spare disk, which may be typical with a traditional RAID group).

Generally, it may be expected that storage management application 21 may evenly distribute the RAID extents to all disks in the pool, and further expected that all disk space is consumed no matter whether their capacity is the same or not. Typically, when one disk fails, the replacement may be found from other live disks for each disk extent on the dead drive. For instance, and referring at least to the example implementation of FIG. 5, an example disk extent replacement during disk fail in Mapped RAID layout 500 b of the example Mapped RAID extent layout 500 a is shown. Generally, an example limitation for the disk extents selection may be that there should be a guarantee that each RAID extent straddles 5 different disks (e.g., assuming the layout in FIG. 5). Moreover, storage management application 21 may be expected to distribute the dead disk extent replacements evenly to live disks.

Example Mapped RAID Rebuild Performance Consideration

As shown in FIG. 5, with Mapped RAID, the example limitation of having the single spare disk write bandwidth may be resolved, since storage management application 21 may replace dead disk extents with extents on different disks. Generally, if better rebuild performance is desired, as many disks as possible should be enabled to participate in the rebuilding procedure. In some implementations, a way to achieve this may be for storage management application 21 to evenly distribute Mapped RAID extents to all the disks in the pool while creating the mapped RAID.

Example RAID Extent Layout

In some implementations, one Mapped RAID group may be a set of ordered RAID extents. When creating a Mapped RAID group, storage management application 21 may need to allocate many RAID extents from the extent pool. As noted above, one RAID extent may need a RAID width number of disk extents from different disks in the extent pool. Generally, storage management application 21 may allocate the RAID extents one by one. For ease of explanation only, assume the disk number in the pool is N, and the RAID extent width is M. In the example, there should be C_(n) ^(m) possible ways to combine a RAID extent. A typical case may be for storage management application 21 to create 4D+1P mapped RAID 5 on top of 16 disks, where there are C₁₆ ⁵=4368 ways to allocate a RAID extent on top of 16 disks. In some implementations, for each RAID extent allocation, storage management application 21 may loop over all the possible choices, and select the best one. In the example, the searching depth may be C_(n) ^(m).

Example Pool with Hybrid Disk Capacities:

In some implementations, it may be desirable to have the disks with different capacities to coexist on a disk pool; however, generally, the more common scenario may be that with the passage of time, the disk pool, upon which Mapped RAID may be based, may be replaced or disks with different capacities may be added due to, e.g., sparing or expansion. Generally, there may be some approaches to address this issue. For example, the first approach may include grouping the disks by capacity, and laying out RAID extents on the respective groups. This may require a minimal size for each group, which may result in a minimal disk count limitation for each capacity. As another example, a second approach may include using the larger disk as a smaller one before reaching the minimal count, but this may result in some wasted disk capacity.

Example Mapped Raid Reliability Model:

As noted above, a failed drive may be rebuilt and written to the new drive, and the rebuild time may be subject to the write bandwidth of the hot spare storage device, which may become a bottleneck. In some situations, it may be difficult to reduce the rebuild time for RAID. Generally, a rebuild failure may occur in one or more ways. For example, one way may be when additional drives fail completely exceeding the capability of the parity protection scheme to compensate for the failures (e.g., one additional drive for RAID 5 and two additional drives for RAID 6, etc.).

Another example way may be when data on a drive (or two drives in the case of RAID 6, etc.) needed to perform some portion of the rebuild cannot be reliably read (though the drive itself may not have failed). This example may be proportional to the amount of data that needs to be read during the rebuild and may be independent of the number of drives that need to be read. For example, the failure of a 1 terabyte (TB) drive in a 4+1 RAID 5 may require 4 TB of data to be read from the remaining drives, regardless of whether that 4 TB is read from 4 drives or 40 drives. As such, in terms of comparing the rebuild failure rates between Mapped RAID and “traditional” RAID, the second one may be the same when rebuilding a given size drive and only the first one needs to be looked at for differences.

Generally, the probability of N drives staying alive during rebuild time may be the probability of an individual drive not failing during the rebuild time to the power of N. An example formula for this may be: P=EXP(−RT/MTTF){circumflex over ( )}N

Where,

EXP=e (the base of the natural logarithm) raised to the given power

N=the number of drives involved in the rebuild

RT=the rebuild time

MTTF=the mean time to drive failure

As can be seen from the above example formula, as the number of drives used to perform the rebuild increases, the rebuild time must decrease (i.e., the rebuild rate must increase) to compensate.

For instance, assume for example purposes only a 4+1 RAID 5 RAID group including 1 TB drives with a MTTF of 1.2 million hours and a rebuild rate of 40 MB/s. For traditional RAID, the probability of the rebuild completing without another drive failing may be: P=EXP(−(1 TB*1024 GB/TB*1024 MB/GB/40 MB/sec)/(1,200,000 hours*3600 sec/hours)){circumflex over ( )}4=0.999976

Thus, for Mapped RAID with, e.g., 49 drives used for the rebuild: 0.999976<=EXP(−(1*1024*1024/<rebuild rate>)/(1,200,000*3600)){circumflex over ( )}49

In this example, solving for the rebuild rate may yield a required rebuild rate of approximately 500 MB/s. Thus, as long as Mapped RAID gets a rebuild rate of at least 500 MB/s using 49 drives (which may be a 12.5× improvement over the rebuild rate using 4 drives), the probability of the rebuild failing due to a drive failure is no worse for Mapped RAID than for traditional RAID. In some implementations, and based on some measurements, using less drives (e.g., 43 drives) for a rebuild may achieve, e.g., a 20× rebuild rate improvement.

Example Disk Partner Group (DPG):

In a Drive Extent Pool, there may be a limit to how many “partners” a particular drive may have. Broadly defined, a partner of a given drive may be any drive with a drive extent in any RAID extent that also includes a drive extent from the given drive. This may result in segmenting a large Drive Extent Pool into drive partnership sets, for which this limitation may be due to the increased probability that a drive needed for a rebuild fails during the rebuild. For example, in a 4+1 RAID 5 configuration, a drive with, e.g., 100 drive extents may, without such a limit, have those drive extents in RAID extents that also include drive extents from, e.g., 400 other drives. As such, should that drive fail, the rebuild process (e.g., via storage management application 21) may have to access portions of those 400 drives in order to perform the rebuild. Requiring such a large number of drives may increase the probability that a drive needed for the rebuild fails during the rebuild.

Example “Single Drive Expansion” and DPG Split:

A potential example benefit of Mapped RAID, may be that the extent pool may be expanded on a per drive basis or by multiple drives. RAID extent may be limited in the DPG; so the DPG size may need to be larger than the RAID width. As mentioned above, the DPG size may have an upper limit. Therefore, when the expansion crosses the DPG size, storage management application 21 may have to split DPG to make the single driver expansion possible. For instance, assume for example purposes only that the maximum DPG size is 64, the extent pool already has 64 disks (or other storage device), and a user wants to expand it with one disk (or other storage device). In this example, the existing 64 disk DPG may need to be split into two parts, and storage management application 21 may add the new disk to one of them.

Example Neighborhood Matrix:

In some implementations, storage management application 21 may evaluate whether or not the RAID extents distribution is even among the storage devices, which may be accomplished using a “neighborhood matrix.” For example, and referring at least to the example implementation of FIG. 6, an example disk relationship layout 600 is shown. Generally, a neighborhood matrix may be described as an N*N square matrix, where N is the number of disks in the pool. Each number in the matrix may be denoted as NM(i, j), which stands for how many times disk i has ever neighbored with disk j. While allocating a RAID extent, storage management process 10 may select some disk extents from different disks. In some implementations, storage management process 10 may define disks in the RAID extent neighbors with each other one time. Generally, the matrix should be a symmetric matrix, since with the example definition of “neighbor,” NM(i, j) should be equal to NM(j, i). As shown in FIG. 6, storage management application 21 may combine 5 disk extents that may be from 5 different disks together into one RAID extent. After the RAID extent is created, storage management application 21 may generally count these 5 disk neighbors each other one time. For example, disk_0 is neighbors with disk_3 one time, disk_3 is neighbors with disk_9 one time, etc.

Matrix Examples:

Referring at least to the example implementation of FIG. 7, an example of a “good” example matrix 700 a and of a “bad” example matrix 700 b is shown. In good example matrix 700 a, the numbers in the matrix are closer to each other, which may range from, e.g., 19 to 21 in this example. In the bad example matrix 700 b, there is shown a significant difference between the numbers in the matrix, and even worse, some numbers are zero, which means that some disks never neighbor with each other. Therefore, in this example, if one disk fails, some disks may not participate the rebuilding procedure.

Example Weighted Neighborhood Matrix:

Generally, when the above-noted neighborhood matrix is “flat,” the “neighbor times” between disks are similar, meaning storage management application 21 may allocate similar disk extent counts from each disk no matter what the real disk capacity is. For a pool with hybrid disk capacity, this may waste large amounts of disk capacity.

In some implementations, to take into account the disk capacity factor, storage management application 21 may make use of a Weighted Neighborhood Matrix (WNM) defined below by example: WNM_(i,j)=NM_(i,j) *S _(typical) *S _(typical)/(S _(i) *S _(j)), where

-   -   S_(typical): defined generally as the typical disk size in the         pool, which may be minimal or other typical disk size in the         pool.     -   S_(i),S_(j): defined generally as the size of the i-th or j-th         disk in the pool.

With this weighted neighborhood matrix, storage management application 21 may normalize a larger disk's “neighborhood times” with other disks by a typical disk size. Therefore, storage management application 21 may allocate more extents from this disk to make the matrix more “flat.” In some implementations, if storage management application 21 evenly distributes the RAID extents to disks in the pool with the bias to larger disks, values in the matrix may be closer to each other. Therefore, storage management application 21 may use an algorithm, which may make values in the weighted neighborhood matrix almost the same after completing the RAID extents allocation.

As will be discussed below, split process 10 may at least help, e.g., the improvement of an existing storage technology, necessarily rooted in computer technology in order to overcome an example and non-limiting problem specifically arising in the realm of computer storage. For instance, split process 10 may use an efficient process to split disk partner groups (DPGs) for extent pools with hybrid capacity disks (or other storage devices). With this process, the ability to do single drive expansion may be possible without sacrificing the reliability and capacity utilization efficiency.

The Split Process:

As discussed above and referring also at least to the example implementations of FIGS. 8-9, split process 10 may initialize 800, on a computing device, an N*N Weighted Neighborhood Matrix according to an existing Mapped RAID layout. Split process 10 may partition 802 N disks in an original disk partner group (DPG) into a target DPG, where N is a number of disks in an extent pool, wherein the N disks have at least two different capacities. Split process 10 may mark 804 the target DPG for at least a portion of the N disks. Split process 10 may mark 806 the target DPG for E RAID extents, where E is a number of RAID extents in the original DPG. Split process 10 may move 808 at least a portion of disk extents for the E RAID extents in the original DPG to the target DPG.

As noted above, an example benefit of Mapped RAID may be the ability to provide better rebuild performance than traditional RAID, and to get a better rebuild performance when creating a Mapped Raid, split process 10 may attempt to evenly distribute Mapped RAID extents to disks. This may be due to the fact that when disks fail in the same time, they may contain data for the same RAID extent, which may leads to data loss. The more disks in one extent pool, the more possible disks may fail in the same time. To help reduce the data loss risk, split process 10 may partition the extent pool to separate fault tolerant zones, named as disk partner group (DPG). It will be appreciated that while “disks” are used in the example, other storage device types may be used without departing from the scope of the disclosure. Therefore, as used herein, the term disk may be used interchangeably with other storage device types where appropriate. As such, the use of a disk should be taken as example only and not to otherwise limit the scope of the disclosure.

As also noted above, a potential example benefit of Mapped RAID, may be that the extent pool may be expanded on a per drive basis or by multiple drives. RAID extent may be limited in the DPG so the DPG size may need to be larger than the RAID width. As mentioned above, the DPG size may have an upper limit. Therefore, when the expansion crosses the DPG size, storage management application 21 may have to split DPG to make the single driver expansion possible. For instance, assume for example purposes only that the maximum DPG size is 64, the extent pool already has 64 disks (or other storage device), and a user wants to expand it with one disk (or other storage device).

In use, the extent pool may include many disks with different capacities (e.g., hybrid capacity disks), which may further complicate expanding a DPG For example, an extent pool may include, e.g., 8 1 TB size disks and, e.g., 8 2 TB size disks, thereby creating a hybrid capacity extent pool. As will be discussed in greater detail below, marking and splitting RAID extents by leveraging the above-noted Weighted Neighborhood Matrix may enable split process 10 to split DPGs in an extent pool with hybrid capacity disks (e.g., disks in an extent pool that may have different storage capacities), which may enable the ability to perform a single drive expansion, but not sacrifice the above-noted reliability and capacity utilization efficiency. Additionally, in some implementations, by having split process 10 plan the disk extent movement when splitting, and by evenly distributing the RAID extents to all disks in each DPG after the split with a similar consumed ratio of disks in the DPG split process 10 may split DPGs in an extent pool with hybrid capacity disks without sacrificing the above-noted reliability and capacity utilization efficiency.

In some implementations, split process 10 may initialize 800, on a computing device (e.g., computer 12), an N*N Weighted Neighborhood Matrix according to an existing Mapped RAID layout. For instance, based on the existing Mapped Raid Layout, split process 10 may calculate the neighborhood matrix according to the Weighted Neighborhood Matrix (WNM) defined above.

In some implementations, split process 10 may partition 802 N disks in an original disk partner group (DPG) into a target DPG, where N is a number of disks in an extent pool, wherein the N disks have at least two different capacities (e.g., hybrid capacity disks). For instance, and referring at least to the example implementation of FIG. 9, an example disk splitting layout of a DPG is shown. In the example, DPG 0 may be considered the “original” DPG that will be split. As can be seen, the Mapped RAID has created (e.g., via split process 10) DPG 900 to be split. As will be discussed below, split process 10 may split DPG 900 to two parts (e.g., DPG 0 and target DPG 1). For ease of explanation only, assume that the number of RAID extents in DPG 0 as E, the width of the Mapped RAID extent as M, and the number of disks in the extent pool as N. Further assume that the extent pool contains one DPG (i.e., DPG 0), the disk number in DPG 0 is N, and the disk RAID extent width is M.

In some implementations, split process 10 may partition 802 the N disks in the original DPG (e.g., DPG 0) into two parts (e.g., DPG 0 and target DPG 1). For example, one example technique may split DPG 0 into two equal parts, e.g., 32 disk DPG split to 2 16 disks DPG Other techniques for partitioning and partitioning parts may also be used without departing from the scope of the disclosure.

In some implementations, split process 10 may mark 804 the target DPG for at least a portion of the N disks. For example, split process 10 may mark target DPG 1 for each disk in original DPG 0. In the example, split process 10 may mark 804 the first part with another DPG id (e.g., first part remains DPG 0, second part changed to DPG 1.

In some implementations, split process 10 may mark 806 the target DPG for E RAID extents, where E is a number of RAID extents in the original DPG. For example, split process 10 may mark all of target DPG 1 for all RAID extents. In some implementations, split process 10 may loop over all RAID extents, and for each RAID extent split process 10 may mark 806 its target DPG. One way to do this may be to mark it interleaving (e.g., RAID extent 1 for DPG 0, RAID extent 2 for DPG 1, RAID extent 3 for DPG 0, RAID extent 4 for DPG 1, etc.

In some implementations, split process 10 may calculate the number of RAID extents for each target DPG (e.g., DPG 1) based on the capacity of each target DPG (e.g., DPG 1). For instance, and referring at least to FIG. 9, in some cases, the DPG cannot be split to 2 equal parts (e.g., a 31 disk DPG). In the example, the two parts are not equal in capacity, which may mean that one DPG may have more RAID extents (capacity) than another after the split.

In some implementations, split process 10 may move 808 at least a portion of disk extents for the E RAID extents in the original DPG to the target DPG. For example, generally, when split process 10 splits DPG 0, the space may have already been allocated to the Mapped RAID groups. Split process 10 has partitioned the DPG 0 disks into two groups (e.g., DPG 0 and DPG 1) and may move 808 disk extent data to make each RAID extent only span one group. For example, as shown in FIG. 9, the DPG 0 split is shown as being split into DPG 0 (e.g., first 4 disks) and target DPG 1 (e.g., last 4 disks). Thus, as shown in the example, RAID extent 1,3,5,7 are moved 808 to DPG 0 and 2,4,6,8 are moved to DPG 1. In FIG. 9, the disk extents denoted in different font are moved 808 during the splitting process.

In some implementations, moving 808 at least the portion of disk extents for the E RAID extents in the original DPG to the target DPG may include selecting 810 a target RAID extent, for each of at least the portion of disk extents, which may result in a balance of free disk extent counts in the original DPG and the target DPG For instance, the free disk extent for each DPG may be limited, and to avoid burn out of the free disk extents of each target DPG split process 10 may select 810 the RAID extents based on the current free disk extent count of DPG 0 and try to make the free disk extent count balance between the target DPG For example, in FIG. 9, at the first line, the “2” at the left and “3” at the right may exchange disk position after the split to make RAID extent 3 fully in DPG 0, and RAID extent 2 fully in DPG 1. That means the first “2” in first line needs to move to the 6th disk, and first “3” in the first line needs to move to 3rd disk. So, the 3rd or 6th disk must have free extents to make the movement possible. In other words, if the 3rd disk has free extents, then move “3” to the 3rd disk first, if the 6th disk has free extents, then move “2” to the 6th disk first.

In some implementations, moving 808 at least the portion of disk extents for the E RAID extents in the original DPG to the target DPG may include virtually removing 812 from the original DPG any disk extents for the E RAID extents belonging to the target DPG For example, in FIG. 9, the first “2” needs to move to DPG 1, but a target disk must be selected. For the selection, split process 10 may first assume the “2” is removed from DPG 0 and update the Weighted Neighborhood Matrix accordingly.

In some implementations, split process 10 may update 814 the N*N Weighted Neighborhood Matrix based upon, at least in part, the virtual removal. For instance, for each RAID extent, split process 10 may update 814 the neighborhood matrix by removing the disk extent from the DPG not being targeted. For example, based on the current existing Mapped RAID layout, split process 10 may calculate the neighborhood matrix as discussed above. For example, in FIG. 9, the 3rd disk and the 5th disk neighborhood value (e.g., NW(3,5) and NW(5,3)) is 2 (e.g., common in RAID extent 2 and 8). When planning to move the first “2”, the value may be changed to 1 (e.g., only common in RAID extent 8).

In some implementations, a new disk extent may be located 816 in the target DPG for each disk extent virtually removed. In some implementations, when locating 816 the new disk extents, split process 10 may do it for the disk extents one by one. For instance, for one RAID extent, there may be many disk extents needed to be moved. Split process 10 may move them one by one (e.g., in FIG. 9, RAID extent “6”, 2 disk extents need to be moved to DPG 1 (e.g., “6” in second line and the first “6” in third line.

Locating 816 the new disk extent in the target DPG for each disk extent virtually removed may include locating 818 a valid and optimal disk extent in the target DPG that may result in a lowest variance of sub-matrix values for the target DPG For example, for each disk extent's allocation, split process 10 may attempt to find the position that makes the above-noted neighborhood matrix of target DPG 0 more “flat.” For example, as discussed above, with this weighted neighborhood matrix, split process 10 may normalize a larger disk's “neighborhood times” with other disks by a typical disk size. Therefore, split process 10 may allocate more extents from this disk to make the matrix more “flat.” In some implementations, if split process 10 evenly distributes the RAID extents to disks in the pool with the bias to larger disks, values in the matrix may be closer to each other. Therefore, split process 10 may use an algorithm, which may make values in the weighted neighborhood matrix almost the same after completing the RAID extents allocation. For example, the position to generate the lowest variance may mean that if split process 10 moves the disk extent to this position, the sub-matrix of the split DPG may be more “flat”.

In some implementations, split process 10 may allocate 820 the new disk extent in the target DPG for each disk extent virtually removed, and in some implementations, may again update the Weighted Neighborhood Matrix accordingly. For instance, when split process 10 attempts a candidate disk, split process 10 may check the matrix variance change. The candidate making the matrix the flattest may be selected for allocation.

In some implementations, and referring at least to the example implementations of FIGS. 10-11, the running results of some typical cases implemented by split process 10 are shown. FIG. 10 shows an example small pool configuration split (e.g., where the disk number in the extent pool N is 16, and the RAID extent width M is 5 (4+1 R5)), and FIG. 11 shows an example large pool configuration split (e.g., where the disk number in the extent pool N is 64, and the RAID extent width M is 16 (14+2 R6)). As can be seen, after the split, the upper-right and lower-left of neighborhood matrix will be all 0. That is the expected result of split, meaning the DPG is separated to two parts. As can be seen in FIGS. 10-11, the results of the split (lower part), the matrix is split to 2 parts. The neighborhood value of the disks in DPG 0 and DPG 1 is 0. The left part is Weighted Neighborhood Matrix, and the right part is the Raw Neighborhood Matrix.

The terminology used herein is for the purpose of describing particular implementations only and is not intended to be limiting of the disclosure. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. As used herein, the language “at least one of A, B, and C” (and the like) should be interpreted as covering only A, only B, only C, or any combination of the three, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps (not necessarily in a particular order), operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps (not necessarily in a particular order), operations, elements, components, and/or groups thereof.

The corresponding structures, materials, acts, and equivalents (e.g., of all means or step plus function elements) that may be in the claims below are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The description of the present disclosure has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the disclosure in the form disclosed. Many modifications, variations, substitutions, and any combinations thereof will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the disclosure. The implementation(s) were chosen and described in order to explain the principles of the disclosure and the practical application, and to enable others of ordinary skill in the art to understand the disclosure for various implementation(s) with various modifications and/or any combinations of implementation(s) as are suited to the particular use contemplated.

Having thus described the disclosure of the present application in detail and by reference to implementation(s) thereof, it will be apparent that modifications, variations, and any combinations of implementation(s) (including any modifications, variations, substitutions, and combinations thereof) are possible without departing from the scope of the disclosure defined in the appended claims. 

What is claimed is:
 1. A computer-implemented method comprising: initializing, on a computing device, an N*N Weighted Neighborhood Matrix according to an existing Mapped RAID layout; partitioning N disks in an original disk partner group (DPG) into a target DPG, where N is a number of disks in an extent pool, wherein the N disks have at least two different capacities; marking the target DPG for at least a portion of the N disks; marking the target DPG for E RAID extents, where E is a number of RAID extents in the original DPG; and moving at least a portion of disk extents for the E RAID extents in the original DPG to the target DPG, wherein moving the at least a portion of disk extents for the E RAID extents includes moving each disk extent associated with a respective RAID extent such that the respective RAID extent spans a single DPG.
 2. The computer-implemented method of claim 1 wherein moving at least the portion of disk extents for the E RAID extents in the original DPG to the target DPG includes selecting a target RAID extent, for each of at least the portion of disk extents, resulting in a balance of free disk extent counts in the original DPG and the target DPG.
 3. The computer-implemented method of claim 2 wherein moving at least the portion of disk extents for the E RAID extents in the original DPG to the target DPG includes virtually removing from the original DPG any disk extents for the E RAID extents belonging to the target DPG.
 4. The computer-implemented method of claim 3 further comprising updating the N*N Weighted Neighborhood Matrix based upon, at least in part, the virtual removal.
 5. The computer-implemented method of claim 3 further comprising locating a new disk extent in the target DPG for each disk extent virtually removed.
 6. The computer-implemented method of claim 5 wherein locating the new disk extent in the target DPG for each disk extent virtually removed includes locating a valid and optimal disk extent in the target DPG that results in a lowest variance of sub-matrix values for the target DPG.
 7. The computer-implemented method of claim 6 further comprising allocating the new disk extent in the target DPG for each disk extent virtually removed.
 8. A computer program product residing on a non-transitory computer readable storage medium having a plurality of instructions stored thereon which, when executed across one or more processors, causes at least a portion of the one or more processors to perform operations comprising: initializing an N*N Weighted Neighborhood Matrix according to an existing Mapped RAID layout; partitioning N disks in an original disk partner group (DPG) into a target DPG, where N is a number of disks in an extent pool, wherein the N disks have at least two different capacities; marking the target DPG for at least a portion of the N disks; marking the target DPG for E RAID extents, where E is a number of RAID extents in the original DPG; and moving at least a portion of disk extents for the E RAID extents in the original DPG to the target DPG, wherein moving the at least a portion of disk extents for the E RAID extents includes moving each disk extent associated with a respective RAID extent such that the respective RAID extent spans a single DPG.
 9. The computer program product of claim 8 wherein moving at least the portion of disk extents for the E RAID extents in the original DPG to the target DPG includes selecting a target RAID extent, for each of at least the portion of disk extents, resulting in a balance of free disk extent counts in the original DPG and the target DPG.
 10. The computer program product of claim 9 wherein moving at least the portion of disk extents for the E RAID extents in the original DPG to the target DPG includes virtually removing from the original DPG any disk extents for the E RAID extents belonging to the target DPG.
 11. The computer program product of claim 10 wherein the operations further comprise updating the N*N Weighted Neighborhood Matrix based upon, at least in part, the virtual removal.
 12. The computer program product of claim 10 wherein the operations further comprise locating a new disk extent in the target DPG for each disk extent virtually removed.
 13. The computer program product of claim 12 wherein locating the new disk extent in the target DPG for each disk extent virtually removed includes locating a valid and optimal disk extent in the target DPG that results in a lowest variance of sub-matrix values for the target DPG.
 14. The computer program product of claim 13 wherein the operations further comprise allocating the new disk extent in the target DPG for each disk extent virtually removed.
 15. A computing system including one or more processors and one or more memories configured to perform operations comprising: initializing an N*N Weighted Neighborhood Matrix according to an existing Mapped RAID layout; partitioning N disks in an original disk partner group (DPG) into a target DPG, where N is a number of disks in an extent pool, wherein the N disks have at least two different capacities; marking the target DPG for at least a portion of the N disks; marking the target DPG for E RAID extents, where E is a number of RAID extents in the original DPG; and moving at least a portion of disk extents for the E RAID extents in the original DPG to the target DPG, wherein moving the at least a portion of disk extents for the E RAID extents includes moving each disk extent associated with a respective RAID extent such that the respective RAID extent spans a single DPG.
 16. The computing system of claim 15 wherein moving at least the portion of disk extents for the E RAID extents in the original DPG to the target DPG includes selecting a target RAID extent, for each of at least the portion of disk extents, resulting in a balance of free disk extent counts in the original DPG and the target DPG.
 17. The computing system of claim 16 wherein moving at least the portion of disk extents for the E RAID extents in the original DPG to the target DPG includes virtually removing from the original DPG any disk extents for the E RAID extents belonging to the target DPG.
 18. The computing system of claim 17 wherein the operations further comprise updating the N*N Weighted Neighborhood Matrix based upon, at least in part, the virtual removal.
 19. The computing system of claim 17 wherein the operations further comprise locating a new disk extent in the target DPG for each disk extent virtually removed.
 20. The computing system of claim 19 wherein locating the new disk extent in the target DPG for each disk extent virtually removed includes locating a valid and optimal disk extent in the target DPG that results in a lowest variance of sub-matrix values for the target DPG. 